Some Elimination Problems for Matrices

نویسندگان

  • Wilhelm Plesken
  • Daniel Robertz
چکیده

problem: Given: A field K and n variables x1, . . . , xn and m polynomials yi = pi(x1, . . . , xn) ∈ K[x1, . . . , xn] for i = 1, . . . ,m. (1) Aim: Find a presentation for the subring K[y] := K[y1, . . . , ym] of K[x] := K[x1, . . . , xn]. Invariants: The difference of m and the transcendence degree of K(y) := K(y1, . . . , ym) over K will be called the deficiency d = d(y) of the tuple y in K(x). Assumption: K perfect, so that the deficiency d(y) can be computed from the rank of the Jacobian matrix J := ( ∂yi ∂xj ) ∈ K(x) m×n, viz. d(y) = m− rank(J).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elimination techniques: from extrapolation to totally positive matrices and CAGD

In this survey, we will show some connections between several mathematical problems such as extrapolation, linear systems, totally positive matrices and computer-aided geometric design, with elimination techniques as the common tool to deal with all of them. c © 2000 Elsevier Science B.V. All rights reserved.

متن کامل

Techniques for Parallel Manipulation of Sparse Matrices

New techniques are presented forthe manipulation of sparse matrices on parallel MIMD computers. We consider the following problems: matrix addition, matrix multiplication, row and column permutation, matrix transpose, matrix vector multiplication, and Gaussian elimination.

متن کامل

Orthogonalization-based Iterative Solvers for Generalized Stokes Problems

Two methods for solving the generalized Stokes problems that occur in viscous, incompressible ows are described and tested. Both are based on some type of linear algebraic orthogonaliza-tion process. The rst, EMGS, is a preconditioner derived from an incomplete Gram{Schmidt factorization, and it is proven to exist whenever the matrix being preconditioned can be factored using Gaussian eliminati...

متن کامل

Multilevel ILU decomposition

In this paper, the multilevel ILU (MLILU) decomposition is introduced. During an incomplete Gaussian elimination process new matrix entries are generated such that a special ordering strategy yields distinct levels. On these levels, some smoothing steps are computed. The MLILU decomposition exists and the corresponding iterative scheme converges for all symmetric and positive deenite matrices. ...

متن کامل

Ela Bidiagonal Decompositions, Minors and Applications

Abstract. Matrices, called ε-BD matrices, that have a bidiagonal decomposition satisfying some sign constraints are analyzed. The ε-BD matrices include all nonsingular totally positive matrices, as well as their matrices opposite in sign and their inverses. The signs of minors of ε-BD matrices are analyzed. The zero patterns of ε-BD matrices and their triangular factors are studied and applied ...

متن کامل

Some Results on Sparse Matrices*

A comparison in the context of sparse matrices is made between the Product Form of the Inverse PFI (a form of Gauss-Jordan elimination) and the Elimination Form of the Inverse EFI (a form of Gaussian elimination). The precise relation of the elements of these two forms of the inverse is given in terms of the nontrivial elements of the three matrices L, U, U~l associated with the triangular fact...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007